Scheduling with Controllable Processing Times

نویسنده

  • M. Selim Akturk
چکیده

In today's industrial world, demand nature is changing where the customers are looking for a high variety of products. In order to meet varying customer demands, the firms should be flexible enough to produce parts in an efficient way. The flexible manufacturing systems have emerged with the progress in manufacturing technology. A flexible manufacturing system (FMS) is a computer-controlled production system consisting of numerically controlled machines and an automated material handling system. In an earlier study, we showed that the required processing times on a CNC machining center can be determined by adjusting the operational parameters of cutting speed and feed rate for a given performance measure [1]. We know that scheduling decisions are quite sensitive to the processing times, hence we can optimize the scheduling and machining related measures simultaneously by considering the interrelated subproblems of processing time control, cutting tool allocation and machining conditions optimization [2]. For example, advances in cutting tool materials and designs will increase the cutting speeds at which the machining is carried out, consequently reducing machining cost at the expense of higher initial tooling cost and higher nonmachining cost due to more frequent tool changes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing

In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...

متن کامل

SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

متن کامل

A Bi-Objective Airport Gate Scheduling with Controllable Processing Times Using Harmony Search and NSGA-II Algorithms

Optimizing gate scheduling at airports is an old, but also a broad problem. The main purpose of this problem is to find an assignment for the flights arriving at and departing from an airport, while satisfying a set of constraints.A closer look at the literature in this research line shows thatin almost all studies airport gate processing time has been considered as a fix parameter. In this res...

متن کامل

Approximation schemes for job shop scheduling problems with controllable processing times q

In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial...

متن کامل

Job Shop Scheduling Problems with Controllable Processing Times

In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial...

متن کامل

Positive half-products and scheduling with controllable processing times

We study the single machine scheduling problem with controllable job processing times to minimize a linear combination of the total weighted job completion time and the total weighted processing time compression. We show that this scheduling problem is a positive half-product minimization problem. Positive half-products make up an interesting subclass of half-products and are introduced in this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002